Stacking Ellipses—Revisited

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stacking mice

We show that either of the following hypotheses imply that there is an inner model with a proper class of strong cardinals and a proper class of Woodin cardinals. 1) There is a countably closed cardinal κ ≥ א3 such that κ and (κ) fail. 2) There is a cardinal κ such that κ is weakly compact in the generic extension by Col(κ, κ). Of special interest is 1) with κ = א3 since it follows from PFA by ...

متن کامل

Soft Stacking

In this paper, we present a continuous approach to ordering 2D images when compositing. Previous methods for stacking image layers require them to appear in a single (though possibly different) order at every point in the image. Our soft stacking approach removes this restriction – allowing layers to stack as if they were volumes of fog, appearing partially in front of and partially in back of ...

متن کامل

Asymptotic pseudounitary stacking operators

Stacking operators are widely used in seismic imaging and seismic data processing. Examples include Kirchhoff datuming, migration, offset continuation, DMO, and velocity transform. Two primary approaches exist for inverting such operators. The first approach is iterative least-squares optimization, which involves the construction of the adjoint operator. The second approach is asymptotic invers...

متن کامل

Case stacking in nanosyntax

Abstract In this paper, I discuss a possibility for extending the nanosyntactic approach to case assignment and realization in order to model case stacking. Building on the work by Caha (2009), I show that nanosyntax can derive instances of overt case stacking as well as abstract case stacking. emain idea is that a case checking head can attract more than one K(ase)P. is leads to congurations ...

متن کامل

Sloane's box stacking problem

Recently, Sloane suggested the following problem: We are given n boxes, labeled 1, 2, . . . , n. For i = 1, . . . , n, box i weighs (m − 1)i grams (where m ≥ 2 is a fixed integer) and box i can support a total weight of i grams. What is the number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it? Prior to this generalized pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The College Mathematics Journal

سال: 1993

ISSN: 0746-8342,1931-1346

DOI: 10.1080/07468342.1993.11973567